Some Remarks on Image Compression based on Reed-Muller Transform
نویسندگان
چکیده
منابع مشابه
Lossless binary image compression using logic functions and spectra
A lossless compression of images using coding schemes and patterns that include minterm, cube and coordinate data coding, Walsh, triangular and Reed–Muller weights based patterns, Reed–Muller spectra and reference row technique is proposed. The experimental results indicate that the technique is fairly efficient when compared with other methods based on representations of logic functions. 2003 ...
متن کاملSteganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images
In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...
متن کاملImplementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey
Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
متن کاملRemarks on Codes, Spectral Transforms, and Decision Diagrams
In this paper, we discuss definitions, features, and relationships of Reed-Muller transforms, Reed-Muller codes and their generalizations to multiple-valued cases, and Reed-Muller decision diagrams. The novelty in this primarily review paper resides in putting together these concepts in the same context and providing a uniform point of view to their definition in terms of a convolutionwise mult...
متن کاملRemarks on low weight codewords of generalized affine and projective Reed-Muller codes
A brief survey on low weight codewords of generalized Reed-Muller codes and projective generalized Reed-Muller codes is presented. In the affine case some information about the words that reach the second distance is given. Moreover the second weight of the projective Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are given.
متن کامل